Bidirected and unidirected capacity installation in telecommunication networks
نویسندگان
چکیده
In the design of telecommunication networks, decisions concerning capacity installation and routing of commodities have to be taken simultaneously. Network Loading problems formalize these decisions in mathematical optimization models. Several variants of the problem exist: bifurcated or non-bifurcated routing, bidirected or unidirected capacity installation, and symmetric versus non-symmetric routing restrictions. Moreover, di9erent concepts of reliability can be considered. In this paper, we study the polyhedral structure of two basic problems for non-bifurcated routing: network loading with bidirected and unidirected capacity installation. We show that strong valid inequalities for the substructure restricted to a single edge, are also strong valid inequalities for the overall models. In a computational study, several classes of inequalities, both for the substructure and the overall problem, are compared on real-life instances for both variants of network loading. ? 2003 Elsevier B.V. All rights reserved.
منابع مشابه
Vehicular Networks: A Survey on Architecture, Communication Technologies and Applications
The Intelligent Transportation System (ITS) provides wireless and mobile communication between vehicles and infrastructure to improve the safety of transportation and make the journey more enjoyable. This system consists of many fixed and mobile nodes (Vehicles, Trains, Vessels, Air planes), Wireless and Wired Telecommunication Technologies to exchange information between mobile nodes or betwee...
متن کاملOn cut-based inequalities for capacitated network design polyhedra
In this article we study capacitated network design problems. We unify and extend poly-hedral results for directed, bidirected and undirected link capacity models. Based on validinequalities for a network cut we show that regardless of the link capacity model, facets of thepolyhedra associated with such a cut translate to facets of the original network design polyhedraif the...
متن کاملA simple algorithm that proves half-integrality of bidirected network programming
In a bidirected graph, each end of each edge is independently oriented. We show how to express any column of the incidence matrix as a half-integral linear combination of any column basis, through a simplification, based on an idea of Bolker, of a combinatorial algorithm of Appa and Kotnyek. Corollaries are that the inverse of each nonsingular square submatrix has entries 0, ±12 , and ±1, and t...
متن کاملBidirected minimum Manhattan network problem
In the bidirected minimum Manhattan network problem, given a set T of n terminals in the plane, we need to construct a network N (T) of minimum total length with the property that the edges of N (T) are axis-parallel and oriented in a such a way that every ordered pair of terminals is connected in N (T) by a directed Manhattan path. In this paper, we present a polynomial factor 2 approximation ...
متن کاملFrequency reassignment problem in mobile communication networks
In this paper, we present a new frequency reassignment problem (FP) arising from the installation of new base stations for capacity expansion of a mobile telecommunication network, and develop two mathematical formulations along with some valid inequalities. Also, we develop a novel decomposition based heuristic procedure for solving large size problems. Computational results show that the deve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 133 شماره
صفحات -
تاریخ انتشار 2003